Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
681	16th Canadian Conference on Computational Geometry, 2004 An Average Running Time Analysis of a Backtracking Algorithm to Calculate the Measure of the Union of Hyperrectangles in Dimensions Susumu Suzuki Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Operations research NP-complete problems Search algorithms Analysis of algorithms Boolean satisfiability problem Backtracking Algorithm PP Time complexity Theoretical computer science Applied mathematics Computational complexity theory
682	A New Algorithmic Approach to the Minority Game Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2012-09-20 14:36:16 Abstraction Complex systems theory Complexity Holism Transdisciplinarity Kolmogorov complexity Computational complexity theory Standard deviation String Statistics Theoretical computer science Computability theory
683	ICS 162 – Spring 2001 – Final Exam Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2003-12-01 14:01:08 Applied mathematics Automata theory Models of computation Mathematical optimization NP Deterministic pushdown automaton Pushdown automaton P Complement Theoretical computer science Computational complexity theory Complexity classes
684	On Rank Aggregation of Multiple Orderings in Network Design Hadas Shachnai, Computer Science Dept., Technion, Haifa 32000, Israel Lisa Zhang, Bell Labs, Lucent Technologies, 600 Mountain Ave., Murray Hill, NJ 07974 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2007-03-07 16:59:32 Complexity classes Mathematical optimization Structural complexity theory Conjectures Permutation NP Directed acyclic graph Optimization problem Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
685	How to Go Beyond the Black-Box Simulation Barrier Boaz Barak∗ December 30, 2008 Abstract The simulation paradigm is central to cryptography. A simulator is an algorithm that tries Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2011-10-10 23:51:40 Probabilistic complexity theory Cryptographic protocols Computational complexity theory Complexity classes Zero-knowledge proof Interactive proof system IP Commitment scheme NP Theoretical computer science Applied mathematics Cryptography
686	Abstract This is the user’s manual for DEGAS 2 - A Monte Carlo code for the study of neutral atom and molecular transport in confined plasmas. It is intended to provide an introduction to DEGAS 2 from the user’s poin Add to Reading List Source URL: w3.pppl.gov Language: English - Date: 2015-03-25 15:29:17 Computational physics Statistical mechanics Monte Carlo method Numerical analysis Probabilistic complexity theory Plasma Fortran Edgar Degas Xi Physics Computing Software engineering
687	1 Complexity of Algorithms Lecture Notes, SpringPeter G´acs Add to Reading List Source URL: www.cs.elte.hu Language: English - Date: 2010-10-17 05:06:21 Complexity classes Analysis of algorithms Probabilistic complexity theory Computational resources NP Time complexity P Randomized algorithm Theory of computation Theoretical computer science Computational complexity theory Applied mathematics
688	CS 373 Midterm 1 Questions (February 20, 2001) Spring 2001 Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:35 Binary trees Analysis of algorithms Sorting algorithms Computational complexity theory Skip list Time complexity Splay tree Treap Quicksort Theoretical computer science Applied mathematics Mathematics
689	Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-03-01 11:15:08 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Vertex cover Time complexity Steiner tree problem Theoretical computer science Computational complexity theory Applied mathematics
690	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:22 NP-complete problems Operations research Approximation algorithm Travelling salesman problem APX Steiner tree problem Algorithm Set cover problem Reduction Theoretical computer science Computational complexity theory Applied mathematics

UPDATE